Mosaic: A Non-Intrusive Complete Garbage Collector for DSM System
نویسندگان
چکیده
Little work has been done in garbage collection algorithms for distributed shared memory systems. Mosaic is a safe and complete garbage collection system that collects garbage in object systems that are implemented above page-based distributed shared memory systems. It is non-intrusive in its impact on application performance. Mosaic partitions the virtual address space into separately managed regions, which form the basic unit of object storage. Garbage collection operates by moving objects between these partitions in a manner that associates live objects together leaving unreachable objects behind so that partitions may be reused. To provide for safe operation of the collector a distributed update protocol maintains sufficient local knowledge of pointer duplication and destruction to allow safe determination of object reachability without the need to globally trace the object space. Mosaic exploits the semantics of pointer operations in type-safe object languages to allow for a weakened consistency model of pointer update during garbage collection.
منابع مشابه
Nonintrusive Cloning Garbage Collection with Stock Operating System Support
It is well accepted that Garbage Collection simpliies programming, promotes modularity, and reduces development eeort. However it is commonly believed that these advantages do not counteract the price that has to be paid: excesive overheads, possible long pause times, and the need of modifying existing code. Even though there exist publically available garbage collectors that can be used in exi...
متن کاملConservative Garbage Collection on Distributed Shared Memory Systems
In this paper we present the design and implementationof a conservative garbage collection algorithm for distributed shared memory (DSM) applications that use weakly–typed languages like C or C++, and evaluate its performance. In the absence of language support to identify references, our algorithm constructed a conservative approximation of the set of cross–node references based on local infor...
متن کاملEnsuring the Safety of Distributed Garbage Collection in DMOS
An orthogonally persistent system maintains data beyond any program execution. The principle of persistence identification implies that persistence by reachability be used to determine which objects are to be maintained in the store. A particular execution may cause objects to become unreachable—garbage. Any efficient implementation of a persistent system must incorporate a garbage collector to...
متن کاملTraining Distributed Garbage: The DMOS Collector
A new garbage collection algorithm for distributed object systems, called DMOS (Distributed Mature Object Space), is presented. It is derived from two previous algorithms, MOS (Mature Object Space), sometimes called the train algorithm, and PMOS (Persistent Mature Object Space). The contribution of DMOS is that it provides the following unique combination of properties for a distributed collect...
متن کاملParMarkSplit: A Parallel Mark-Split Garbage Collector Based on a Lock-Free Skip-List
This brief announcement provides a high level overview of a parallel mark-split garbage collector. Our parallel design introduces and makes use of an efficient concurrency control mechanism based on a lock-free skip-list design for handling the list of free memory intervals. We have implemented the parallel mark-split garbage collector in OpenJDK HotSpot as a parallel and concurrent garbage col...
متن کامل